#include<bits/stdc++.h>
using namespace std;
int n,a[100005],cnt,minx=1;
int main()
{
        freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
	    cin>>a[i];
	}
	stable_sort(a+1,a+n+1);
	for(int i=2;i<=n;i++)
	{
	     if(a[i]>a[minx])
	     {
	       minx++;
	       cnt++;
	     }
	}
	cout<<n-cnt;
	return 0;
	   
}
